Network Algebra for Synchronous and Asynchronous Dataflow

Network algebra is proposed as a uniform algebraic framework for the description and analysis of dataflow networks. An equational theory, called BNA (Basic Network Algebra), is presented. BNA, which is essentially a part of the algebra of flownomials, captures the basic algebraic properties of networks. For synchronous and asynchronous dataflow networks, additional constants and axioms for connections are given; and corresponding process algebra models are introduced. The main difference between these models is in the interpretation of the identity connections, called wires in dataflow networks. The process algebra model for the asynchronous case is compared with previous models.